Exact Weight Perfect Matching of Bipartite Graph is NP - Complete ∗
نویسندگان
چکیده
This paper proves that the complexity of exact weight perfect matching problem is NPcomplete by reduction from the good perfect matching problem. Following this result, the other two open problems DNA sequence analysis and discrete min-max assignment problems are proven to be NPcomplete.
منابع مشابه
Bipartite matching extendable graphs
Matching extendability is significant in graph theory and its applications. The basic notion in this direction is n-extendability introduced by Plummer in 1980. Motivated by the different natures of bipartite matchings and non-bipartite matchings, this paper investigates bipartite-matching extendable (BM-extendable) graphs. A graph G is said to be BM-extendable if every matching M which is a pe...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملOn the complexity of the exact weighted independent set problem
Suppose we have a well-solved optimization problem, such as minimum spanning tree, maximum cut in planar graphs, minimum weight perfect matching, or maximum weight independent set in a bipartite graph. How hard is it to determine whether there exists a solution with a given weight ? Papadimitriou and Yannakakis showed in [PAPADIMITRIOU 82] that these so-called exact versions of the above optimi...
متن کاملAll Permutations Supersequence is coNP-complete
We prove that deciding whether a given input word contains as subsequence every possible permutation of integers {1, 2, . . . , n} is coNP-complete. The coNP-completeness holds even when given the guarantee that the input word contains as subsequences all of length n−1 sequences over the same set of integers. We also show NP-completeness of a related problem of Partially Non-crossing Perfect Ma...
متن کاملOn the NP-completeness of the perfect matching free subgraph problem
Given a bipartite graph G = (U ∪ V , E) such that | U |=| V | and every edge is labelled true or false or both, the perfect matching free subgraph problem is to determine whether or not there exists a subgraph of G containing, for each node u of U , either all the edges labelled true or all the edges labelled false incident to u, and which does not contain a perfect matching. This problem arise...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008